On Coded Caching with Heterogeneous Distortion Requirements

نویسندگان

  • Abdelrahman M. Ibrahim
  • Ahmed A. Zewail
  • Aylin Yener
چکیده

This paper considers heterogeneous coded caching where the users have unequal distortion requirements. The server is connected to the users via an error-free multicast link and designs the users’ cache sizes subject to a total memory budget. In particular, in the placement phase, the server jointly designs the users’ cache sizes and the cache contents. To serve the users’ requests, in the delivery phase, the server transmits signals that satisfy the users’ distortion requirements. An optimization problem with the objective of minimizing the worst-case delivery load subject to the total cache memory budget and users’ distortion requirements is formulated. The optimal solution for uncoded placement and linear delivery is characterized explicitly and is shown to exhibit a threshold policy with respect to the total cache memory budget. As a byproduct of the study, a caching scheme for systems with fixed cache sizes that outperforms the state-of-art is presented.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coded Caching and Content Delivery with Heterogeneous Distortion Requirements

Cache-aided coded content delivery is studied for devices with diverse quality-of-service (QoS) requirements. The network consists of a server, which holds a database of independent contents, and users equipped with local caches of different capacities. User caches are filled by the server during a low traffic period without the knowledge of particular user demands. It is assumed that each user...

متن کامل

Optimization of Heterogeneous Coded Caching

This paper aims to provide an optimization framework for coded caching that accounts for various heterogeneous aspects of practical systems. An optimization theoretic perspective on the seminal work on the fundamental limits of caching by Maddah Ali and Niesen is first developed, whereas it is proved that the coded caching scheme presented in that work is the optimal scheme among a large, non-t...

متن کامل

New Order-Optimal Decentralized Coded Caching Schemes with Good Performance in the Finite File Size Regime

Recently, a new class of random coded caching schemes have received increasing interest, as they can achieveorder-optimal memory-load tradeoff through decentralized content placement. However, most of these existing decen-tralized schemes may not provide enough coded-multicasting opportunities in the practical operating regime wherethe file size is limited. In this paper, we propose...

متن کامل

Learning-Aided Collaborative Caching in Small Cell Networks

Caching enables reduction of peak backhaul load in modern wireless systems by allowing popular files to be pre-fetched and stored locally and closer to the network edge. With the shift in paradigm from homogeneous to heterogeneous cellular networks, data offloading to small cell base stations (sBS) has garnered recent attention. Caching at the sBS can help avoid bottlenecks in the capacity limi...

متن کامل

Coded Caching with Heterogeneous Cache Sizes and Link Qualities: The Two-User Case

The centralized coded caching problem is studied under heterogeneous cache sizes and channel qualities from the server to the users, focusing on the two-user case. More specifically, a server holding N files is considered to be serving two users with different cache sizes, each requesting a single file, and it is assumed that in addition to the shared common link, each user also has a private l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1802.10073  شماره 

صفحات  -

تاریخ انتشار 2018